Certain finite linear groups of prime degree
نویسندگان
چکیده
منابع مشابه
Finite imprimitive linear groups of prime degree
In an earlier paper the authors have classified the nonsolvable primitive linear groups of prime degree over C. The present paper deals with the classification of the nonsolvable imprimitive linear groups of prime degree (equivalently, the irreducible monomial groups of prime degree). If G is a monomial group of prime degree r, then there is a projection π of G onto a transitive group H of perm...
متن کاملpaper Finite primitive linear groups of prime degree
In our paper referred to above we claim to enumerate all nite primitive linear groups of prime degree r over C with a nonabelian socle. However, the case where the socle is imprimitive was overlooked. In the present paper we deal with this case to complete the classi cation. 2000 Mathematics Subject Classi cation: 20H20 20C15 20C33 In the paper referred to above, we state a theorem (Theorem 1....
متن کاملON THE CHARACTERISTIC DEGREE OF FINITE GROUPS
In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...
متن کاملFinite groups with $X$-quasipermutable subgroups of prime power order
Let $H$, $L$ and $X$ be subgroups of a finite group$G$. Then $H$ is said to be $X$-permutable with $L$ if for some$xin X$ we have $AL^{x}=L^{x}A$. We say that $H$ is emph{$X$-quasipermutable } (emph{$X_{S}$-quasipermutable}, respectively) in $G$ provided $G$ has a subgroup$B$ such that $G=N_{G}(H)B$ and $H$ $X$-permutes with $B$ and with all subgroups (with all Sylowsubgroups, respectively) $...
متن کاملRamsey Multiplicity of Linear Patterns in Certain Finite Abelian Groups
Abstract. It is well known (and a result of Goodman) that a random 2-colouring of the edges of a large complete graph Kn contains asymptotically (in n) the minimum number of monochromatic triangles (K3s). Erdős conjectured that a random 2-colouring also minimises the number of monochromatic K4s, but his conjecture was disproved by Thomason in 1989. The question of determining for which small gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1974
ISSN: 0021-8693
DOI: 10.1016/0021-8693(74)90139-2